The Fast DCT and IDCT Algorithm by Subband Decomposition of Signal
نویسندگان
چکیده
Abstract DCT (Discrete Cosine Transforms) and IDCT (Inverse Discrete Cosine Transforms) are widely used for digital signal and image processing. Computational efficiency of DCT and IDCT dominate the performance of processing. How to improve computational efficiency is still an interesting topic for many researchers. In this study, the multiple-level resolution DCT in which the subband decomposition of a signal is carried out is proposed to find the DCT coefficients of a signal in an efficient way. The number of multiplications of the proposed algorithm is less than those of study reported so far, the computational efficiency is then improved by the proposed algorithm.
منابع مشابه
An Efficient VLSI Linear Array for DCT/IDCT Using Subband Decomposition Algorithm
Discrete Cosine transform DCT and inverse DCT IDCT have been widely used in many image processing systems and real-time computation of nonlinear time series. In this paper, a novel lineararray of DCT and IDCT is derived from the data flow of subband decompositions representing the factorized coefficient matrices in the matrix formulation of the recursive algorithm. For increasing the throughput...
متن کاملMedical image compression using DCT-based subband decomposition and modified SPIHT data organization
OBJECTIVE The work proposed a novel bit-rate-reduced approach for reducing the memory required to store a remote diagnosis and rapidly transmission it. METHOD In the work, an 8x8 Discrete Cosine Transform (DCT) approach is adopted to perform subband decomposition. Modified set partitioning in hierarchical trees (SPIHT) is then employed to organize data and entropy coding. The translation func...
متن کاملA Novel Linear Array for Discrete Cosine Transform
Abstract: Discrete cosine transform (DCT) and inverse DCT (IDCT) have been widely used in many image processing systems. In this paper, a novel linear-array of DCT and IDCT is derived from the data flow of subband decompositions representing the factorized coefficient matrices in the matrix formulation of the recursive algorithm. For increasing the throughput as well as decreasing the hardware ...
متن کاملEarly Determination of Zero-Quantized 8 , ×, 8 DCT Coefficients
This paper proposes a novel approach to early determination of zero-quantized 8× 8 discrete cosine transform (DCT) coefficients for fast video encoding. First, with the dynamic range analysis of DCT coefficients at different frequency positions, several sufficient conditions are derived to early determine whether a prediction error block (8× 8) is an all-zero or a partial-zero block, i.e., the ...
متن کاملModeling DCT coefficients for fast video encoding
Digital video coding standards such as H.263 and MPEG are becoming more and more important for multimedia applications. Due to the huge amount of computations required, there are significant efforts to speed up the processing of video encoders. Previously, the efforts were mainly focused on the fast motion-estimation algorithm. However, as the motion-estimation algorithm becomes optimized, to s...
متن کامل